A Mechanisation of Classical Modal Tense Logics Using Isabelle
نویسندگان
چکیده
We present an implementation of an interactive theorem prover for the basic tense logic Kt, and many of its extensions, using the generic proof assistant Isabelle. The novelty of the implementation is that we use a Display Logic formalism of Kt as opposed to a traditional Gentzen system. The prover is intended to assist in meta-theoretical studies of tense logics rather than to be a fast theorem prover. Since Display Logic is a generic way to capture multi-modal logics, our implementation can be trivially extended to handle the multi-modal logics of \time", \knowledge", \intentions", \desires" and \beliefs" which are used in Artiicial Intelligence research.
منابع مشابه
Embedding of Quantified Modal Logic in Higher Order Logic Seminar Paper on Expressive Logics and their Automation
Church’s Simple Theory of Types (STT, also referred to as classical higher-order logic) is an elegant and expressive formal language that can represent complex (higher-order) properties and formulae. In this paper, an encoding of second-order quantified modal logic (QML) in STT, due to C. Benzmüller and L. C. Paulsen, is discussed. Main results include the soundness and completeness of this enc...
متن کامل1 Embedding of First-Order Nominal Logic into Higher-Order Logic
Nominal logic, also referred to as hybrid logic, is a general term for extensions of ordinary modal logics that introduce a new sort of atomic formulae, the socalled nominals. These nominals are only true at one possible world and false at every other world. The shifter, denoted @, can be used to evaluate the truth of a formula φ at a given world corresponding to nominal i as in @iφ. The simple...
متن کاملTutorial on Reasoning in Expressive Non-Classical Logics with Isabelle/HOL
Non-classical logics (such as modal logics, description logics, conditional logics, multi-valued logics, hybrid logics, etc.) have many applications in artificial intelligence. In this tutorial, we will demonstrate a generic approach to automate propositional and quantified variants of non-classical logics using theorem proving systems for classical higher-order logic. Our particular focus will...
متن کاملNatural Deduction for Non-Classical Logics
We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large famili...
متن کاملOn intuitionistic modal and tense logics and their classical companion logics: Topological semantics and bisimulations
We take the well-known intuitionistic modal logic of Fischer Servi with semantics in bi-relational Kripke frames, and give the natural extension to topological Kripke frames. Fischer Servi’s two interaction conditions relating the intuitionistic pre-order (or partial-order) with the modal accessibility relation generalise to the requirement that the relation and its inverse be lower semi-contin...
متن کامل